perm filename PERLIS.BIB[S87,JMC] blob
sn#840181 filedate 1987-05-13 generic text, type C, neo UTF8
COMMENT ā VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 perlis.bib[s87,jmc] Don Perlis bibliography on non-monotonic reasoning
C00054 ENDMK
Cā;
perlis.bib[s87,jmc] Don Perlis bibliography on non-monotonic reasoning
A BIBLIOGRAPHY OF LITERATURE ON NON-MONOTONIC REASONING
Donald Perlis
Computer Science Department
and
Institute for Advanced Computer Studies
University of Maryland
College Park, MD 20742
Akama, S. [1987] Presupposition and frame problem in
knowledge bases. In Proceedings of the 1987 Workshop on
the Frame Problem in Artificial Intelligence, Lawrence,
KS, pp 193-203.
Allen, J. [1984] Towards a general theory of action and
time, Artificial Intelligence 23 (2), 1984, pp 123-154.
Apt, K., Blair, H. and Walker, A. [1986] Towards a theory
of declarative knowledge. In Proceedings of the 1986
Workshop on Foundations of Deductive Databases and Logic
Programming, 1986. Also to appear in Foundations of Deduc-
tive Databases and Logic Programming, J. Minker (ed.),
Morgan Kaufmann, Los Altos, 1987.
Asher, N. [1984] Linguistic understanding and non-monotonic
reasoning. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 1-20, American Association for Artificial
Intelligence, New Paltz, NY.
Besnard, Ph., Quiniou, R., and Quinton, P. [1983] A
theorem-prover for a decidable subset of default logic.
Proc. AAAI-83, pp. 27-30.
Bobrow, D. G. and Hayes, P. J. [1985] Artificial intelli-
gence - where are we? Artificial Intelligence, 24, pp
375-415, 1985.
Borgida, A. and Imielinski, T. [1984] Decision making in
committees--A framework for dealing with inconsistency and
non-monotonicity. In Proceedings 1984 Nonmonotonic Rea-
soning Workshop, pp 21-32, American Association for Artif-
icial Intelligence, New Paltz, NY.
Bossu, G. and Siegel, P. [1985] Saturation, nonmonotonic
reasoning and the closed-world assumption. Artificial
Intelligence, 25, pp 13-63, 1985.
Brachman, R. [1982] What `IS-A' is and isn't, Proc. Canadian
Soc. for Computational Studies of Intelligence-82, Saska-
toon, Sask., May 17-19, pp 212-220. Also in IEEE Computer,
16(10), pp 30-36, 1983.
Brachman, R. [1985] I lied about the trees or, defaults and
definitions in knowledge representation. AI Magazine,
6(3), pp 80-93, 1985.
Brewka, G. [1987] The logic of frames with exceptions. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, pp 77-87.
Brown, F. M. [1987] A modal logic for the representation
of knowledge. In Proceedings of the 1987 Workshop on the
Frame Problem in Artificial Intelligence, Lawrence, KS, pp
135-157.
Brown, F. M., and Park, S. S. [1987] Action, reflective
possibility, and the frame problem. In Proceedings of the
1987 Workshop on the Frame Problem in Artificial Intelli-
gence, Lawrence, KS, pp 159-174.
de Champeaux, D. [1987] Unframing the frame problem. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, pp 311-318.
Clark, K. [1978] Negation as failure. In: Logic and Data-
bases, Gallaire, H. and Minker, J. (eds.). Plenum Press,
New York, pp. 293-322.
Cottrell, G. [1984] Re: Inheritance hierarchies with excep-
tions. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 33-56, American Association for Artificial
Intelligence, New Paltz, NY.
Cottrell, G. [1985]. Parallelism in inheritance hierarchies
with exceptions, Proc. Ninth International Joint Confer-
ence on Artificial Intelligence, Los Angeles, CA, Aug.
18-23, 1985, pp 194-202.
Davis, M. [1980] The mathematics of non-monotonic reasoning.
Artificial Intelligence, 13 (1,2), pp. 73-80.
Doyle, J. [1977] Truth maintenance systems for problem solv-
ing. Proc. 5th IJCAI, p. 247.
Doyle, J. [1979] A glimpse of truth maintenance. Proc. 6th
IJCAI, pp. 232-237.
Doyle, J. [1979] A truth maintenance system. Artificial
Intelligence, 12, pp 231-272.
Doyle, J. [1982] Some theories of reasoned assumptions: An
essay in rational psychology. Technical Report, Depart-
ment of Computer Science, Carnegie-Mellon University.
Doyle, J. [1983] The ins and outs of reason maintenance.
Proc. 8th IJCAI, pp. 349-351.
Doyle, J. [1984] Circumscription and implicit definability.
In Proceedings 1984 Nonmonotonic Reasoning Workshop, pp
57-69, American Association for Artificial Intelligence,
New Paltz, NY. Also in J. of Automated Reasoning, 1, pp
391-405, 1985.
Doyle, J. [1985] Reasoned assumptions and Pareto optimal-
ity. In Proceedings of the Ninth International Joint
Conference on Artificial Intelligence, pp 87-90.
Doyle, J., and London, P. [1980] A selected descriptor-
indexed bibliography to the literature on belief revision,
AI Memo 568, MIT, Cambridge, Mass.
Drapkin, J. and Perlis, D. [1986] Step-logics: An alterna-
tive approach to limited reasoning. Proc. European Confer-
ence on Artificial Intelligence, Brighton, 1986.
Drapkin, J. and Perlis, D. [1986] Preliminary excursion into
step-logics. Proceedings, International Symposium on
Methodologies for Intelligent Systems, Knoxville, KY.
Elgot-Drapkin, J., Miller, M. and Perlis, D. [1987] The two
frame problems. In Proceedings of the 1987 Workshop on
the Frame Problem in Artificial Intelligence, Lawrence,
KS, pp 23-28.
Elgot-Drapkin, J., Miller, M. and Perlis, D. [1987] Life on
a desert island: Ongoing work on a real-time reasoning.
In Proceedings of the 1987 Workshop on the Frame Problem
in Artificial Intelligence, Lawrence, KS, pp 349-357.
Etherington, D. W [1982] Finite default theories. MSc
Thesis, University of British Columbia.
Etherington, D. W. [1986] Reasoning with incomplete infor-
mation: Investigations of non-monotonic reasoning. PhD
thesis, University of British Columbia, Vancouver, Canada,
1986.
Etherington, D.W. [1987] Relating default logic and cir-
cumscription, IJCAI-87 , Milan.
Etherington, D.W. [1987] A semantics for default logic,
IJCAI-87, Milan.
Etherington, D.W. [1987] On inheritance hierarchies with
exceptions: Default theories and inferential distance,
AAAI-87, Seattle.
Etherington, D. W. [1987] Formalizing nonmonotonic reasoning
systems. Artificial Intelligence, 31, pp 41-85, 1987.
Etherington, D.W. and Mercer, R.E. [1986] Domain cir-
cumscription revisited, Proc. Canadian Society for Compu-
tational Studies of Intelligence-86, Montreal, May 1986.
Etherington, D.W. and Mercer, R.E. [1987] Domain cir-
cumscription: a re-evaluation, Computational Intelligence
3.
Etherington, D. W., Mercer, R. E., and Reiter, R. [1985] On
the adequacy of predicate circumscription for closed-world
reasoning. Comp. Intelligence, 1, pp 11-15.
Etherington, D. W. and Reiter, R. [1983] On inheritance
hierarchies with exceptions. Proc. AAAI-83, pp. 104-108.
Fahlman, S., Touretzky, D., and Van Roggen, W. [1981] Can-
cellation in a parallel semantic network. Proc. 7th
IJCAI, pp. 257-263.
Finger, J. J. [1987] Exploiting constraints in design syn-
thesis. PhD thesis, Stanford University, Stanford, CA,
1987.
Fischler, M. and Firschein, O. [1984] Computational vision
as a (non-monotonic) reasoning process. In Proceedings
1984 Nonmonotonic Reasoning Workshop, pp 82-92, American
Association for Artificial Intelligence, New Paltz, NY.
Gabbay, D. [1982] Intuitionistic basis for non-monotonic
logic. Lecture Notes in Computer Science, Vol. 139,
Springer.
Gelfond, M. [1986] On stratified autoepistemic theories.
Technical Report, University of Texas at El Paso, 1986.
Gelfond, M. and Przymusinska, H. [1986] On the relationship
between autoepistemic logic and parallel circumscription.
Technical Report, University of Texas at El Paso, 1986.
Gelfond, M. and Przymusinska, H. [1986] Negation as failure:
Careful closure procedure. Artificial Intelligence, 30,
pp 273-287, 1986.
Gelfond, M., Przymusinska, H. and Przymusinsk, T. [1986]
The extended closed world assumption and its relationship
to parallel circumscription. In Proceedings of ACM
SIGACT-SIGMOD Symposium on Principles of Database Systems,
pp 133-139, 1986.
Georgeff, M. P. [1987] Many agents are better than one.
In Proceedings of the 1987 Workshop on the Frame Problem
in Artificial Intelligence, Lawrence, KS, pp 59-75.
Ginsberg, M. L. [1984] Non-monotonic reasoning using
Dempster's rule. In Proceedings of the Fourth National
Conference on Artificial Intelligence, pp 126-129, 1984.
Ginsberg, M. L. [1985] Does probability have a place in
non-monotonic reasoning? In Proceedings of the Ninth
International Joint Conference on Artificial Intelligence,
pp 107-110, 1985.
Ginsberg, M. L. [1986] Counterfactuals. Artificial Intel-
ligence, 30, pp 35-80, 1986.
Ginsberg, M. L. [1986] Multi-valued Inference. Technical
Report 86-73, KSL, Stanford University, 1986.
Ginsberg, M. L. [1986] Multi-valued Logics. Technical
Report 86-29, KSL, Stanford University, 1986.
Ginsberg, M. L. [1986] Multi-valued logics. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pp 243-247, 1986.
Ginsberg, M. L. and Smith, D. E. [1987] Reasoning about
action I: A possible worlds approach. In Proceedings of
the 1987 Workshop on the Frame Problem in Artificial
Intelligence, Lawrence, KS, pp 233-258.
Ginsberg, M. L. and Smith, D. E. [1987] Reasoning about
action II: The qualification problem. In Proceedings of
the 1987 Workshop on the Frame Problem in Artificial
Intelligence, Lawrence, KS, pp 259-287.
Glymour, C. and Thomason, R. [1984] Default reasoning and
the logic of theory perturbation. In Proceedings 1984 Non-
monotonic Reasoning Workshop, pp 93-102, American Associa-
tion for Artificial Intelligence, New Paltz, NY.
Goebel, R. G., and Goodwin, S. D. [1987] Applying theory
formation to the planning problem. In Proceedings of the
1987 Workshop on the Frame Problem in Artificial Intelli-
gence, Lawrence, KS, pp 207-232.
Goodwin, J. [1984] WATSON: A dependency directed inference
system. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 103-114, American Association for Artificial
Intelligence, New Paltz, NY.
Grant, J. and Minker, J. [1984] Answering queries in inde-
finite databases and the null value problem. Tech. Report
1374, University of Maryland.
Grosof, B. [1984] Default reasoning as circumscription.
Workshop on Nonmonotonic Reasoning, New Paltz, NY, spon-
sored by AAAI, Oct. 17-19, 1984.
Grosof, B. [1986] Non-monotonicity in probabilistic reason-
ing. In Proceedings 1986 Workshop on Uncertainty in
Artificial Intelligence, pp 91-98, Philadelphia, PA, 1986.
Haas, A. R. [1987] The case for domain-specific frame
axioms. In Proceedings of the 1987 Workshop on the Frame
Problem in Artificial Intelligence, Lawrence, KS, pp 343-
348.
Hallnas, L. [1987] A note on non-monotonic reasoning. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, pp 89-104.
Halpern, J. Y. and Moses, Y. [1984] Towards a theory of
knowledge and ignorance. In Proceedings 1984 Non-
monotonic Reasoning Workshop, pp 165-193, American Associ-
ation for Artificial Intelligence, New Paltz, NY, 1984.
Hanks, S. and McDermott, D. [1986] Default reasoning, non-
monotonic logics and the frame problem. In Proceedings of
the Fifth National Conference on Artificial Intelligence,
pp 328-333, 1986.
Haugh, B. [1987] Simple causal minimizations for temporal
persistence and projection. AAAI-87 to appear.
Hayes, P. [1973] The frame problem and related problems in
artificial intelligence, in Artificial and Human Thinking,
A. Elithorn and D. Jones (eds.), Jossey-Bass Inc., San
Francisco.
Hayes, P. [1987] The frame problem in histories. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, p 31.
Henschen, L. and Park, H.-S. [1986] In Proceedings of the
1986 Workshop on Foundations of Deductive Databases and
Logic Programming, 1986. Also to appear in Foundations of
Deductive Databases and Logic Programming, J. Minker
(ed.), Morgan Kaufmann, Los Altos, 1987.
Imielinski, T. [1987] Results on translating defaults to
circumscription. Artificial Intelligence, 32, pp 131-146.
Israel, D. [1980] What's wrong with non-monotonic logic?
In Proceedings of the First National Conference on Artifi-
cial Intelligence, pp 99-101, 1980.
Joshi, A., Webber, B., and Weischedel, R. [1984] Default
reasoning in interaction. In Proceedings 1984 Nonmono-
tonic Reasoning Workshop, pp 144-150, American Association
for Artificial Intelligence, New Paltz, NY.
Kautz, H. A. [1986] The logic of persistence. In Proceed-
ings of the Fifth National Conference on Artificial Intel-
ligence, pp 401-405, 1986.
de Kleer, J. [1984] Choices without backtracking. In
Proceedings of the Fourth National Conference on Artifi-
cial Intelligence, pp 79-85, 1984.
de Kleer, J. [1986] An assumption-based truth maintenance
system. Artificial Intelligence, 28, pp 127-162, 1986.
de Kleer, J. [1986] Extending the ATMS. Artificial Intel-
ligence, 28, pp 163-196, 1986.
de Kleer, J. [1986] Problem solving with the ATMS. Artifi-
cial Intelligence, 28, pp 197-224, 1986.
de Kleer, J. and Williams, B. C. [1987] Diagnosing multi-
ple faults. Artificial Intelligence, 32, pp 97-130, 1987.
Konolige, K. [1982] Circumscriptive ignorance. Proc. AAAI-
82, pp. 202-204.
Konolige, K. [1984] Belief and incompleteness. SRI Tech.
Note 319.
Konolige, K. [1987] On the relation between default
theories and autoepistemic logic. In Ginsberg, M. L.,
editor, Readings in Non-Monotonic Reasoning, Morgan Kauf-
mann, Los Altos, CA, 1987. Also in Proceedings, IJCAI-87.
Konolige, K. and Myers, K. L. [1987] Representing defaults
with epistemic concepts. Draft, SRI International.
Kowalski, R. [1978] Logic for data description. In:
Logic and Databases, Gallaire, H. and Minker, J. (eds.).
Plenum Press, New York, pp. 77-103.
Kowalski, R. [1979] Logic for Problem Solving. North-
Holland, New York.
Kowalski, R. and Sergot, M. [1986] A logic-based calculus
of events. New Generation Computing, 4, pp 67-95, 1986.
Kramosil, I. [1975] A note on deduction rules with negative
premises. In Proceedings of the Fourth International
Joint Conference on Artificial Intelligence, pp 53-56,
1975.
Kueker, D. [1984] Another failure of completeness for cir-
cumscription. Week on Logic and Artificial Intelligence,
Univ. of Maryland, Oct. 22-26, 1984.
Levesque, H. [1981] Incompleteness in knowledge bases.
SIGART Newsletter 74, p. 150ff.
Levesque, H. [1981] The interaction with incomplete
knowledge bases: a formal treatment. Proc. 7th IJCAI, pp.
240-245.
Levesque, H. [1982] A formal treatment of incomplete
knowledge. Fairchild Lab for AI Research, Tech. Report 3.
Lifschitz, V. [1984] Some results on circumscription.
Workshop on Nonmonotonic Reasoning, New Paltz, NY, spon-
sored by AAAI, Oct. 17-19, 1984.
Lifschitz, V. [1985] Closed-world databases and cir-
cumscription. Artificial Intelligence, 27, pp 229-235,
1985.
Lifschitz, V. [1985] Computing circumscription. In
Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, pp 121-127, 1985.
Lifschitz, V. [1986] On the declarative semantics of logic
programs with negation. In Proceedings of the 1986
Workshop on Foundations of Deductive Databases and Logic
Programming, 1986. Also to appear in Foundations of
Deductive Databases and Logic Programming, J. Minker
(ed.), Morgan Kaufmann, Los Altos, 1987.
Lifschitz, V. [1986] On the satisfiability of circumscrip-
tion. Artificial Intelligence, 28, pp 17-27, 1986.
Lifschitz, V. [1987] Pointwise circumscription. In
Ginsberg, M. L., editor, Readings in Non-Monotonic Reason-
ing, Morgan Kaufmann, Los Altos, CA, 1987.
Lifschitz, V. [1986] Pointwise circumscription: preliminary
report. In Proceedings of the Fifth National Conference
on Artificial Intelligence, pp 406-410, 1986.
Lifschitz, V. [1987] Formal theories of action. IJCAI-87, to
appear.
Lifschitz, V. [1987] Formal theories of action. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, pp 35-57.
Lipski, W. [1977] On the logic of incomplete information.
Lecture Notes in Computer Science, v.53, Springer, pp.
374-381. (6th Symposium on Mathematical Foundations of
Computer Science.)
Lipski, W. [1979] On semantic issues connected with incom-
plete information databases, ACM Transactions on Database
Systems 4 (3), Sept. 1979, pp 262-296.
Lukaszewicz, W. [1984] Considerations on default logic. In
Proceedings 1984 Non-monotonic Reasoning Workshop, pp
165-193, American Association for Artificial Intelligence,
New Paltz, NY, 1984.
Lukaszewicz, W. [1983] General approach to nonmonotonic log-
ics. Proc. 8th IJCAI, pp. 352-354.
Marek, W. [1984] A natural semantics for modal logic over
databases and model-theoretic forcing I. In Proceedings
1984 Nonmonotonic Reasoning Workshop, pp 194-240, American
Association for Artificial Intelligence, New Paltz, NY.
Martins, J. [1983] Reasoning in multiple belief spaces, PhD
thesis, SUNY at Buffalo, Computer Science Technical Report
203.
Martins, J. P. and Shapiro, S. C. [1983] Reasoning in
multiple belief spaces. In Proceedings of the Eighth
International Joint Conference on Artificial Intelligence,
pp 370-373, 1983.
Martins, J. and Shapiro, S. [1984] A model for belief revi-
sion. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 241-294, American Association for Artificial
Intelligence, New Paltz, NY.
McAllester, D.A. [1978] A three-valued truth maintenance
system, AI Memo 473, MIT, Cambridge, Mass.
McAllester, D.A. [1980] An outlook on truth maintenance, AI
Memo 551, MIT, Cambridge, Mass.
McCarthy, J. [1977] Epistemological problems of artificial
intelligence. In Proceedings of the Fifth International
Joint Conference on Artificial Intelligence, pp 1038-1044,
Cambridge, MA, 1977.
McCarthy, J. [1980] Circumscription--a form of non-monotonic
reasoning. Artificial Intelligence, 13 (1,2), pp. 27-39.
McCarthy, J. [1980] Addendum: circumscription and other
non-monotonic formalisms. Artificial Intelligence, 13
(1,2), pp. 171-172.
McCarthy, J. [1984] Applications of circumscription to for-
malizing common sense knowledge. Workshop on Nonmonotonic
Reasoning, New Paltz, NY, sponsored by AAAI, Oct. 17-19,
1984.
McCarthy, J. [1986] Applications of circumscription to for-
malizing common sense knowledge. Artificial Intelligence,
28, pp 89-116, 1986.
McCarthy, J. [1987] The frame problem today. In Proceed-
ings of the 1987 Workshop on the Frame Problem in Artifi-
cial Intelligence, Lawrence, KS, p 3.
McCarthy, J. and Hayes, P. [1969] Some philosophical prob-
lems from the standpoint of artificial intelligence. In
Machine Intelligence 4, Meltzer, B. and Michie, D. (eds.),
Edinburgh University Press.
McCarty, T. [1984] Programming directly in a non monotonic
logic. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 325-336, American Association for Artificial
Intelligence, New Paltz, NY.
McDermott, D. [1982] Non-monotonic logic II: non-monotonic
modal theories. Journal of the ACM, 29 (1), pp. 33-57.
McDermott, D. [1982] A temporal logic for reasoning about
processes and plans. Cognitive Science, 6, pp 101-155.
McDermott, D. [1987] AI, logic, and the frame problem. In
Proceedings of the 1987 Workshop on the Frame Problem in
Artificial Intelligence, Lawrence, KS, pp 105-118.
McDermott, D. [1987] A critique of pure reason. Computa-
tional Intelligence. To appear.
McDermott, D. and Doyle, J. [1980] Non-monotonic logic I.
Artificial Intelligence, 13 (1,2), pp. 41-72.
Mercer, R.E. and Reiter, R. [1982] The representation of
presuppositions using defaults. Proc. 4th Nat. Conf. Can.
Soc. for Computational Studies of Intelligence, Saskatoon,
May 17-19,1982, pp.103-107.
Mercer, R. and Rosenberg, R.S. [1984] Generating corrective
answers by computing presuppositions of answers, not ques-
tions, or Mind your P's, not Q's. Proc CSCSI-84, pp16-18.
Minker, J. [1982] On indefinite databases and the closed-
world assumption. Lecture Notes in Computer Science, v.
138, pp. 292-308, Springer. (6th Conference on Automated
Deduction).
Minker, J. and Perlis, D. [1984] Protected circumscrip-
tion. In Proceedings 1984 Non-monotonic Reasoning
Workshop, pp 337-343, American Association for Artificial
Intelligence, New Paltz, NY, 1984.
Minker, J. and Perlis, D. [1984] Applications of protected
circumscription. Lecture Notes in Computer Science, v.
170, pp. 414-425, Springer. (7th Conference on Automated
Deduction).
Minker, J. and Perlis, D. [1985] Computing protected cir-
cumscription. Logic Programming Journal, 4, 235-249.
Minsky, M. [1975] A framework for representing knowledge.
In P. Winston, editor, The Psychology of Computer Vision,
pp 211-277, McGraw-Hill, 1975.
Moore, R. [1975] Reasoning from incomplete knowledge in a
procedural deduction system. MIT AI Lab Memo 347.
Moore, R. [1983] Semantical considerations on non-monotonic
logic. Proc. 8th IJCAI, pp. 272-279.
Moore. R. [1984] Possible-world semantics for autoepistemic
logic. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 344-354, American Association for Artificial
Intelligence, New Paltz, NY.
Moore, R. [1985] Semantical considerations on nonmonotonic
logic. Artificial Intelligence, 25, pp 75-94, 1985.
Morris, P. [1987] A truth maintenance based approach to
the frame problem. In Proceedings of the 1987 Workshop on
the Frame Problem in Artificial Intelligence, Lawrence,
KS, pp 297-307.
Mott, P. L. [1987] A theorem on the consistency of cir-
cumscription. Artificial Intelligence, 31, 87-98.
Nutter, J. [1983] Default reasoning using monotonic logic:
A modest proposal. In Proceedings of the Third National
Conference on Artificial Intelligence, pp 297-300, 1983.
Nutter, J. [1983] Default reasoning in AI systems. MSc
Thesis, SUNY at Buffalo, Computer Science Tech. Report
204.
Nutter, J. [1983] What else is wrong with nonmonotonic log-
ics? Representational and informational shortcomings.
Proc. 5th Cognitive Science Conference, Rochester.
Papalaskaris, M. A. and Bundy, A. [1984] Topics for cir-
cumscription. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 355-362, American Association for Artificial
Intelligence, New Paltz, NY.
Park, S. S. [1987] Doubting Thomas: Action and belief
revision. In Proceedings of the 1987 Workshop on the
Frame Problem in Artificial Intelligence, Lawrence, KS, pp
175-191.
Pena, L. [1980] The philosophical relevance of a contradic-
torial system of logic. Proc. 10th Int'l Symposium on
Multiple-valued Logic, pp. 238-252.
Perlis, D. [1984] Non-monotonicity and real-time reasoning.
In Proceedings 1984 Nonmonotonic Reasoning Workshop, pp
363-372, American Association for Artificial Intelligence,
New Paltz, NY.
Perlis, D. [1987] On the consistency of commonsense reason-
ing. Computational Intelligence, 2, 1987, 180-190.
Perlis, D. [1987] Circumscribing with sets. Artificial
Intelligence, 31, 201-211.
Perlis, D. [1987] Languages with self-reference II:
Knowledge, belief, and modality. Technical Report, Univer-
sity of Maryland.
Perlis, D. [1987] Circumscription as introspection. Techni-
cal Report, University of Maryland.
Perlis, D. and Minker, J. [1986] Completeness results for
circumscription. Artificial Intelligence, 28, pp 29-42,
1986.
Perrault, R. [1987] An application of default logic to
speech act theory. Technical Report, SRI International,
1987.
Poole, D. [1984] A logical system for default reasoning. In
Proceedings 1984 Nonmonotonic Reasoning Workshop, pp 373-
384, American Association for Artificial Intelligence, New
Paltz, NY.
Przymusinski, T. [1986] Query-answering in circumscriptive
and closed-world theories. In Proceedings of the Fifth
National Conference on Artificial Intelligence, pp 186-
190, 1986.
Przymusinski, T. [1986] On the semantics of stratified
deductive databases. In Proceedings of the 1986 Workshop
on Foundations of Deductive Databases and Logic
Programming, 1986. Also to appear in Foundations of
Deductive Databases and Logic Programming, J. Minker
(ed.), Morgan Kaufmann, Los Altos, 1987.
Raphael, B. [1971] The frame problem in problem-Solving, in
Artificial Intelligence and Heuristic Programming, N.V.
Findler and B. Meltzer (eds.), Edinburgh University Press,
Edinburgh.
Reinfrank, M. [1987] Multiple extensions, where is the
problem? In Proceedings of the 1987 Workshop on the Frame
Problem in Artificial Intelligence, Lawrence, KS, pp 291-
295.
Reggia, J. and Nau, D. [1984] An abductive non-monotonic
logic. In Proceedings 1984 Nonmonotonic Reasoning
Workshop, pp 385-395, American Association for Artificial
Intelligence, New Paltz, NY.
Reiter, R. [1978] On closed world data bases. In H. Gal-
laire and J. Minker, editors, Logic and Data Bases, pp
119-140, Plenum, New York, 1978.
Reiter, R. [1978] On closed world databases. In: Logic
and Databases, Gallaire, H. and Minker, J. (eds.), Ple-
num, pp. 55-76.
Reiter, R. [1978] On reasoning by default. Proceedings
TINLAP-2 (Theoretical Issues in Natural Language
Processing-2), Urbana, Ill.
Reiter, R. [1980] Equality and domain closure in
first-order databases. Journal of the ACM 27 (2), pp.
235-249.
Reiter, R. [1980] A logic for default reasoning, Artificial
Intelligence 13 (1,2), pp. 81-132.
Reiter, R. [1982] Circumscription implies predicate
completion (sometimes). Proc. AAAI-82, pp. 418-420.
Reiter, R. [1987] A theory of diagnosis from first princi-
ples. Artificial Intelligence, 32, pp 57-95.
Reiter, R. [1987] Nonmonotonic reasoning. Annual Reviews
of Computer Science, 1987.
Reiter, R. and Criscuolo, G. [1981] On interacting
defaults. In Proceedings of the Seventh International
Joint Conference on Artificial Intelligence, pp 270-276,
1981.
Reiter, R. and Criscuolo, G. [1983] Some representational
issues in default reasoning. Int. J. Computers and
Mathematics (special issue on computational linguistics).
Reiter, R. and de Kleer, J. [1987] Formal foundations for
assumption-based truth maintenance systems: preliminary
report. Proc. AAAI-87, Amer. Assoc. for Art. Intell. Nat.
Conf., Seattle, to appear.
Rescher, N. [1976] Plausible Inference. Van Gorcum, Assen,
The Netherlands.
Rich, E. [1983] Default reasoning as likelihood reasoning.
In Proceedings of the Third National Conference on Artifi-
cial Intelligence, pp 348-351, 1983.
Rolston, D. W. [1987] Toward a tense-logic-based mitiga-
tion of the frame problem. In Proceedings of the 1987
Workshop on the Frame Problem in Artificial Intelligence,
Lawrence, KS, pp 319-341.
Sandewall, E. [1972] An approach to the frame problem and
its implementation. Machine Intelligence 7, University of
Edinburgh Press.
Sandewall, E. [1983] Partial models, attribute propogation
systems, and non-monotonic semantics. Linkoping Univer-
sity. LITH-IDA-R-83-01.
Sandewall, E. [1987] The frame problem in AI. In Proceed-
ings of the 1987 Workshop on the Frame Problem in Artifi-
cial Intelligence, Lawrence, KS, p 29.
Schwind, C. B. [1987] Action theory and the frame problem.
In Proceedings of the 1987 Workshop on the Frame Problem
in Artificial Intelligence, Lawrence, KS, pp 121-134.
Shepherdson, J. C. [1984] Negation as failure: A comparison
of Clark's completed data base and Reiter's closed world
assumption. J. Logic Programming, 1, pp 51-79, 1984.
Shepherdson, J. C. [1985] Negation as failure II. J. Logic
Programming, 3, pp 185- 202, 1985.
Shepherdson, J. C. [1986] Negation in logic programming. In
Proceedings of the 1986 Workshop on Foundations of Deduc-
tive Databases and Logic Programming, 1986. Also to
appear in Foundations of Deductive Databases and Logic
Programming, J. Minker (ed.), Morgan Kaufmann, Los Altos,
1987.
Shoham,Y. [1986] Chronological ignorance. In Proceedings
of the Fifth National Conference on Artificial Intelli-
gence, pp 389-393, 1986.
Shoham, Y. [1987] Non-monotonic logics. In Ginsberg, M.
L., editor, Readings in Non-Monotonic Reasoning, Morgan
Kaufmann, Los Altos, CA, 1987.
Shoham, Y. [1987] What is the frame problem? In Proceed-
ings of the 1987 Workshop on the Frame Problem in Artifi-
cial Intelligence, Lawrence, KS, pp 5-21.
Stalnaker, R. [1980] A note on non-monotonic modal logic.
Dept. of Philosophy, Cornell University.
Topor, R. and Sonenberg, E. A. [1986] On domain independent
databases. In Proceedings of the 1986 Workshop on Founda-
tions of Deductive Databases and Logic Programming, 1986.
Also to appear in Foundations of Deductive Databases and
Logic Programming, J. Minker (ed.), Morgan Kaufmann, Los
Altos, 1987.
Touretzky, D. [1984] The mathematics of inheritance systems.
Ph.D. Thesis, Carnegie-Mellon University.
Touretzky, D. [1984] Implicit ordering of defaults in
inheritance systems. In Proceedings of the Fifth National
Conference on Artificial Intelligence, pp 322-325, 1984.
Van Gelder, A. [1986] Negation as failure using tight
derivations for general logic programs. In Proceedings of
the 1986 Workshop on Foundations of Deductive Databases
and Logic Programming, 1986. Also to appear in Founda-
tions of Deductive Databases and Logic Programming, J.
Minker (ed.), Morgan Kaufmann, Los Altos, 1987.
Vere, S. [1980] Multi-level counterfactuals for generaliza-
tions of relational concepts and productions. Artificial
Intelligence, 14 (2), pp. 139-164.
Weyhrauch, R. [1980] Prolegomena to a theory of mechanized
formal reasoning Artificial Intelligence, 13 (1,2), pp.
133-170.
Winograd, T. [1980] Extended inference modes in reasoning by
computer systems. Artificial Intelligence 13 (1,2), pp.
5-26.
Yahya, A. and Henschen, L. J. [1985] Deduction in non-Horn
databases. Journal of Automated Reasoning, 1, pp 141-160.
1984 Workshop on Non-Monotonic Reasoning, New Paltz, NY,
1984.
1985 Workshop on Uncertainty and Probability in Artificial
Intelligence, UCLA, Los Angeles, California, 1985.
1986 Workshop on Uncertainty in Artificial Intelligence,
University of Pennsylvania, Philadelphia, PA, 1986.
1986 Workshop on Foundations of Deductive Databases and
Logic Programming, Washington, D.C., 1986.
1987 Workshop on the Frame Problem in Artificial Intelli-
gence, Lawrence, KS, 1987.